Pattern Matching with Differential Voting and Median Transformation Derivation - Improved Point-Pattern Matching Algorithm for Two-Dimensional Coordinate Lists
نویسندگان
چکیده
We describe an algorithm for matching two-dimensional coordinate lists. Such matching should be immune to translation, rotation, scaling and flipping. We assume that coordinate lists may be only partially overlapping and we allow some random perturbations in the lists. Our goal is to match enough points to be able to derive a coordinates transformation with high confidence. The implementation described here is a part of SkySpy automated sky survey system. The presented algorithm is used to perform matching of stars detected during observations with star catalogues.
منابع مشابه
A new approach to point pattern matching
We describe a new algorithm for matching star lists, given by their two-dimensional coordinates. Such matching should be unaffected by translation, rotation, rescaling, random perturbations, and some random additions and deletions of coordinate couples in one list relative to another. The first phase of the algorithm is based on a characterization of a set of coordinate couples, relative to eac...
متن کاملTransformation Hashing: An Efficient Point Pattern Matching Scheme
Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as the largest common point set problem (LCP) under approximate congruence: given two point sets M and Q in R, and a tolerance parameter ǫ ≥ 0, the problem is to find a rigid motion μ such that the...
متن کاملNeighborhood matrix: A new idea in matching of two dimensional gel images
Automated data analysis and pattern recognition techniques are the requirements of biological and proteomicsresearch studies. The analysis of proteins consists of some stages among which the analysis of two dimensionalelectrophoresis (2-DE) images is crucial. The aim of image capturing is to generate a Photostat that can be used infuture works such as image comparison. The researchers introduce...
متن کاملA Novel GA-Based Method for n-Dimensional Point Pattern Matching
Point pattern matching (PPM) is an important problem in pattern recognition, digital video processing and computer vision. In this paper novel robust and fast procedure based on Genetic Algorithm, for n-dimensional PPM is described. Most matching techniques solved the PPM problem by determining the correspondence between points localized spatially within two sets, then to get the proper transfo...
متن کاملFast algorithm for point pattern matching: Invariant to translations, rotations and scale changes
-Based on 2-D cluster approach, a fast algorithm for point pattern matching is proposed to effectively solve the problems of optimal matches between two point pattern under geometrical transformation and correctly identify the missing or spurious points of patterns. Theorems and algorithms are developed to determine the matching pairs support of each point pair and its transformation parameters...
متن کامل